Line Simplification with Restricted Orientations

نویسنده

  • Gabriele Neyer
چکیده

We study the C-oriented line simplification problem: Given a polygonal chain P represented by an ordered set of vertices PI , ... , pn in the plane, a set of orientations C, and a constant c, we search for a "C-oriented" polygonal chain Q consisting of the minimum number of line segments that has distance at most c to P in the Frechet metric. A polygonal chain is C-oriented if the line segments are parallel to orientations in C. We restrict our attention to the version of the problem where two circles of radius c formed around adjacent vertices of the polygonal chain do not intersect. We solve the C-oriented line simplification problem constructively by using dynamic programming together with a nice data structure. For usual cases of C our algorithm solves the problem in time O(kn2 Iog(n)) where k is the minimum number ofline segments of Q and uses O( kn 2 ) space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing polygonal path simplification under area measures

In this paper, we consider the restricted version of the well-known 2D line simplification problem under area measures and for restricted version. We first propose a unified definition for both of sum-area and difference-area measures that can be used on a general path of n vertices. The optimal simplification runs in O(n) under both of these measures. Under sum-area measure and for a realistic...

متن کامل

Restricted-Orientation Convexity in Higher-Dimensional Spaces

A restricted-oriented convex set is a set whose intersection with any line from a fixed set of orientations is either empty or connected. This notion generalizes both orthogonal convexity and normal convexity. The aim of this paper is to establish a mathematical foundation for the theory of restricted-oriented convex sets in higher-dimensional spaces.

متن کامل

Can AxCaliber be extended to estimate axonal radius and orientation at the same time?

Introduction One of the key ideas behind diffusion tensor (DT) imaging that explains its wide applicability, is the assumption that the diffusion of water molecules in live tissues, both inside and outside cells, is hindered in an anisotropic manner by the presence of membranes, and that mean displacement scales with square root of time. This assumption is obviously a simplification: diffusion ...

متن کامل

Path Simplification for Metro Map Layout

We investigate the problem of creating simplified representations of polygonal paths. Specifically, we look at a path simplification problem in which line segments of a simplification are required to conform with a restricted set of directions C. An algorithm is given to compute such simplified paths in O(|C|n) time, where n is the number of vertices in the original path. This result is extende...

متن کامل

Students’ Perceived Classroom Climate and Their Achievement Goal Orientations in an Iranian EFL Context

Classroom climate has been demonstrated to associate with individuals’ various attributes and outcomes. Recent research has also confirmed students’ goal orientations deserving to be recognized as a significant achievement-related outcome. In this line, the current study intended to examine the relationship between Iranian EFL students’ perceptions of their classroom environment and their achie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999